A Novel Method for Counting Models on Grid Boolean Formulas
نویسندگان
چکیده
We research on the possible orientations patterns of a grid graph G, and propose a method for counting certain combinatorial structures over the class of orientations of G. For example, our method can be applied for counting sink-free orientations of G, as well as it can be applied for solving the #2SAT problem for grid Boolean formulas. Our proposal extends the classical transfer matrix method used for counting the number of independent sets in a grid.
منابع مشابه
Computing finite models using free Boolean generators
A parallel method for computing Boolean expressions based on the properties of finite free Boolean algebras is presented. We also show how various finite combinatorial objects can be codded in the formalism of Boolean algebras and counted by this procedure. Particularly, using a translation of first order predicate formulas to propositional formulas, we give a method for constructing and counti...
متن کاملComputing #2-SAT of Grids, Grid-Cylinders and Grid-Tori Boolean Formulas
We present an adaptation of transfer matrix method for signed grids, grid-cylinders and grid-tori. We use this adaptation to count the number of satisfying assignments of Boolean Formulas in 2-CNF whose corresponding associated graph has such grid topologies.
متن کاملA Polynomial Graphical Reduction to Speed Up the Counting of Models for Boolean Formulas
In this paper, we focus on exact, deterministic algorithms for computing the number of models in Boolean formulas in Two Conjuntive Form (2-CF), denoted as #2-SAT problem. We present a series of linear procedures which when they are integrated into a main program, allow us to compute in polynomial time the number of models of a formula F in 2-CF when the constraint graph GF holds the following ...
متن کاملA Novel Control Strategy for a Single-phase Grid-connected Power Injection System
In this paper, a novel and simple control strategy, based on state feedback method is suggested to control the power injection system (PIS). The considered PIS is composed of, a DC voltage source, a voltage source inverter (VSI) and a L-C-L filter. The DC source includes the battery source with boosted voltage. The battery can be charged with photovoltaic cells. Since, the grid voltage acts as ...
متن کاملComputing the Density of States of Boolean Formulas
In this paper we consider the problem of computing the density of states of a Boolean formula in CNF, a generalization of both MAX-SAT and model counting. Given a Boolean formula F , its density of states counts the number of configurations that violate exactly E clauses, for all values of E. We propose a novel Markov Chain Monte Carlo algorithm based on flat histogram methods that, despite the...
متن کامل